Model-Checking Parameterized Systems

نویسندگان

  • N. Liveris
  • H. Zhou
  • R. Dick
  • Y. Chen
  • P. Banerjee
چکیده

In this paper we present a new abstraction technique that enables the usage of model checking for the verification of parameterized systems. The technique targets asynchronous systems. Compared to previous approaches the application of the proposed technique imposes fewer restrictions on the correctness property. Moreover, it can be applied to a class of parameterized systems for which other abstraction methods may not work. We demonstrate the effectiveness of the abstraction technique by applying it on a self-stabilizing spanning tree construction algorithm. Sponsors: NSF, Motorola

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parameterized Systems in BIP: Design and Model Checking

BIP is a component-based framework for system design built on three pillars: behavior, interaction, and priority. In this paper, we introduce first-order interaction logic (FOIL) that extends BIP without priorities to systems parameterized in the number of components. We show that FOIL captures classical parameterized architectures such as token-passing rings, cliques of identical components co...

متن کامل

Beyond Regular Model Checking

In recent years, it has been established that regular model checking can be successfully applied to several parameterized veriication problems. However, there are many parameterized veriication problems that cannot be described by regular languages, and thus cannot be veri-ed using regular model checking. In this study we try to practice symbolic model checking using classes of languages more e...

متن کامل

A Unifying Model Checking Approach for Safety Properties of Parameterized Systems

We present a model checking algorithm for safety properties that is applicable to parameterized systems and hence provides a unifying approach of model checking for parameterized systems. By analysing the conditions under which the proposed algorithm terminates, we obtain a characterisation of a subclass for which this problem is decidable. The known decidable subclasses, token rings and broadc...

متن کامل

Model Checking Systems and Specifications with Parameterized Atomic Propositions

In classical LTL model checking, both the system and the specification are over a finite set of atomic propositions. We present a natural extension of this model, in which the atomic propositions are parameterized by variables ranging over some (possibly infinite) domain. For example, by parameterizing the atomic propositions send and receive by a variable x ranging over possible messages, the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007